The phase transition in random Horn satis ability
نویسندگان
چکیده
This paper studies the phase transition in random Horn satissability: under the random model (n; m) in which a formula is obtained by choosing m clauses independently, uniformly at random, and with repetition from all Horn clauses in n variables, (n) = 2 n is the satissability threshold for the Horn satissability. The threshold is coarse since, if (n) = c 2 n then lim n!1 Pr 2(n;;(n)) is satissable] = 1 ? F(e ?c); where F(x) = (1 ?x)(1?x 2)(1 ?x 4)(1 ?x 8) 1. This resolves both of the two remaining cases of the problem of analyzng phase transitions of the six maximally tractable cases in Schaefer's Dichotomy Theorem.
منابع مشابه
The phase transition in random Horn satis
This paper studies the phase transition in random Horn satissability: under the random model (n; m) in which a formula is obtained by choosing m clauses independently, uniformly at random, and with repetition from all Horn clauses in n variables, (n) = 2 n is the satissability threshold for the Horn satissability. The threshold is coarse since, if (n) = c 2 n then lim n!1 Pr 2(n;;(n)) is satiss...
متن کاملA sharp threshold for the phase transition of a restricted Satisfiability problem for Horn clauses
In this paper we examine a variant, k-HSAT, of the well-known Satis®ability problem, wherein formula instances are limited to CNF formulae having exactly k literals in each clause at most one of which is un-negated. Such formulae correspond to sets of Horn clauses, each of which involves exactly k propositional variables. In addition, rather than seeking instantiations of the propositional vari...
متن کاملAbstraction and the Csp Phase Transition Boundary
ion and the CSP Phase Transition Boundary Robert Schrag and Daniel Miranker Department of Computer Sciences and The Applied Research Laboratories Taylor Hall 2.124, Mail Code C0500 University of Texas at Austin Austin, TX USA 78712 Internet: fschrag|[email protected] WWW: http://www.cs.utexas.edu/users/schrag September 14, 1995 Abstract We describe an abstraction technique for CSPs and ch...
متن کاملA Continuous-Discontinuous Second-Order Transition in the Satisfiability of Random Horn-SAT Formulas
We compute the probability of satisfiability of a class of random Horn-SAT formulae, motivated by a connection with the nonemptiness problem of finite tree automata. In particular, when the maximum clause length is three, this model displays a curve in its parameter space along which the probability of satisfiability is discontinuous, ending in a second-order phase transition where it is contin...
متن کاملThe Search for Satisfaction
In recent years, there has been an explosion of research in AI into propositional satis ability (or Sat). There are many factors behind the increased interest in this area. One factor is the improvement in search procedures for Sat. New local search procedures like Gsat are able to solve Sat problems with thousands of variables. At the same time, implementations of complete search algorithms li...
متن کامل